Bipartite Toughness andk-Factors in Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Bipartite Toughness and k-Factors in Bipartite Graphs
1 School of Mathematics and System Sciences, Shandong University, Jinan 250100, China 2 Department of Computer Science, Memorial University of Newfoundland, St. John’s, NL, Canada A1B 3X5 3 School of Computing, The University of Southern Mississippi, Hattiesburg, MS 39406, USA 4 Department of Mathematics, College of Arts and Sciences, The State University of West Georgia, Carrollton, GA 30118, USA
متن کاملExtensions to 2-Factors in Bipartite Graphs
A graph is d-bounded if its maximum degree is at most d. We apply the Ore– Ryser Theorem on f -factors in bipartite graphs to obtain conditions for the extension of a 2-bounded subgraph to a 2-factor in a bipartite graph. As consequences, we prove that every matching in the 5-dimensional hypercube extends to a 2-factor, and we obtain conditions for this property in general regular bipartite gra...
متن کاملC4–free 2-factors in bipartite graphs
D. Hartvigsen [H] recently gave an algorithm to find a C4–free 2–factor in a bipartite graph and using this algorithm he proved several nice theorems. Now we give a simple inductive proof for a generalization of his Tutte-type theorem, and prove the corresponding Ore-type theorem as well. The proof follows the idea of the inductive proof for the Hall’s theorem given by Halmos and Vaughn [HV].
متن کاملf-Factors in bipartite (mf)-graphs
Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give su6cient conditions for a regular bipartite graph to have a perfect matching excluding a set of edges. In this paper, we give a necessary and su6cient condition for a bipartite graph to have an f-factor containing a set of edges and excluding another set of edges and discuss some applications of this condition. In particular, we obt...
متن کاملCounting 1-Factors in Regular Bipartite Graphs
perfect matchings. (A perfect matching or 1-factor is a set of disjoint edges covering all vertices.) This generalizes a result of Voorhoeve [11] for the case k = 3, stating that any 3-regular bipartite graph with 2n vertices has at least ( 4 3) n perfect matchings. The base in (1) is best possible for any k: let αk be the largest real number such that any k-regular bipartite graph with 2n vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2008
ISSN: 0161-1712,1687-0425
DOI: 10.1155/2008/597408